Nuprl Lemma : eventlist_wf
11,40
postcript
pdf
E
:Type,
pred?
:(
E
(?
E
)),
e
:
E
.
SWellFounded((
(
first(
y
))) c
(
x
= pred(
y
)
E
))
(eventlist(
pred?
;
e
)
(
E
List))
latex
Definitions
x
:
A
.
B
(
x
)
,
P
Q
,
A
c
B
,
t
T
,
x
,
y
.
t
(
x
;
y
)
,
A
,
ge(
i
;
j
)
,
A
B
,
False
,
prop{i:l}
,
eventlist(
pred?
;
e
)
,
Y
,
if
b
then
t
else
f
fi
,
tt
,
ff
,
SWellFounded(
R
(
x
;
y
))
,
x
:
A
.
B
(
x
)
,
,
x
(
s1
,
s2
)
,
Unit
,
,
P
Q
,
P
Q
,
Lemmas
nat
wf
,
strongwellfounded
wf
,
not
wf
,
assert
wf
,
first
wf
,
pred
wf
,
unit
wf
,
nat
properties
,
ge
wf
,
bool
wf
,
eqtt
to
assert
,
iff
transitivity
,
bnot
wf
,
eqff
to
assert
,
assert
of
bnot
,
append
wf
origin